翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Gleason–Prange theorem ： ウィキペディア英語版 Quadratic residue code A quadratic residue code is a type of cyclic code. There is a quadratic residue code of length $p$ over the finite field $GF(l)$ whenever $p$ and $l$ are primes, $p$ is odd, and $l$ is a quadratic residue modulo $p$. Its generator polynomial as a cyclic code is given by :$f(x)=\backslash prod\_(x-\backslash zeta^j)$ where $Q$ is the set of quadratic residues of $p$ in the set $\backslash$ and $\backslash zeta$ is a primitive $p$th root of unity in some finite extension field of $GF(l)$. The condition that $l$ is a quadratic residue of $p$ ensures that the coefficients of $f$ lie in $GF(l)$. The dimension of the code is $(p+1)/2$. Replacing $\backslash zeta$ by another primitive $p$-th root of unity $\backslash zeta^r$ either results in the same code or an equivalent code, according to whether or not $r$ is a quadratic residue of $p$. An alternative construction avoids roots of unity. Define :$g(x)=c+\backslash sum\_x^j$ for a suitable $c\backslash in\; GF(l)$. When $l=2$ choose $c$ to ensure that $g(1)=1$. If $l$ is odd, choose $c=(1+\backslash sqrt)/2$, where $p^$ *=p or $-p$ according to whether $p$ is congruent to $1$ or $3$ modulo $4$. Then $g(x)$ also generates a quadratic residue code; more precisely the ideal of $F\_l()/\backslash langle\; X^p-1\backslash rangle$ generated by $g(x)$ corresponds to the quadratic residue code. The minimum weight of a quadratic residue code of length $p$ is greater than $\backslash sqrt$; this is the square root bound. Adding an overall parity-check digit to a quadratic residue code gives an extended quadratic residue code. When $p\backslash equiv\; 3$ (mod $4$) an extended quadratic residue code is self-dual; otherwise it is equivalent but not equal to its dual. By the Gleason–Prange theorem (named for Andrew Gleason and Eugene Prange), the automorphism group of an extended quadratic residue code has a subgroup which is isomorphic to either $PSL\_2(p)$ or $SL\_2(p)$. Examples of quadratic residue codes include the $(7,4)$ Hamming code over $GF(2)$, the $(23,12)$ binary Golay code over $GF(2)$ and the $(11,6)$ ternary Golay code over $GF(3)$. == References == *F. J. MacWilliams and N. J. A. Sloane, ''The Theory of Error-Correcting Codes'', North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977. *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Quadratic residue code」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.